Matching Texts with SUMMA
نویسنده
چکیده
Résumé. On décrit notre approche au problème de l’appariement de résumés/articles scientifiques proposé par le programme DÉfi Fouille de Textes (DEFT). Nous avons développé un algorithme d’appariement de textes qui utilise des ressources quasiment indépendantes de la langue. L’algorithme crée des representations de documents tout en utilisant le système SUMMA et les compare grâce à une mesure de similarité cosinus qui nous permet de sélectionner le meilleure candidat pour former la paire. Nos résultats indiquent que cette approche est très précise et qu’elle pourrait s’appliquer à d’autres langues.
منابع مشابه
SUMMA-A LSA Integrated Developpement System
Latent Semantic Analysis (LSA) is a technique from the field of natural language processing. Its method is completely statistical in nature, which permits to extract the relations between words based on their common occurrences in texts without any specification of rules or dictionaries. Despite the fact that LSA is only a statistical technique and does not yield real verbal intelligence, it ex...
متن کاملNegation and Speculation Detection in Clinical and Review Texts
PhD Thesis written by Noa P. Cruz Díaz at the University of Huelva under the supervision of Dr. Manuel J. Maña López. The author was examined on 10th July 2014 by a committee formed by the doctors Manuel de Buenaga (European University of Madrid), Mariana Lara Neves (University of Berlin) and Jacinto Mata (University of Huelva). The PhD Thesis was awarded Summa cum laude (International Doctorate).
متن کاملA Fast Matching Method Based on Semantic Similarity for Short Texts
As the emergence of various social media, short texts, such as weibos and instant messages, are very prevalent on today’s websites. In order to mine semantically similar information from massive data, a fast and efficient matching method for short texts has become an urgent task. However, the conventional matching methods suffer from the data sparsity in short documents. In this paper, we propo...
متن کاملSyntax-Based Deep Matching of Short Texts
Many tasks in natural language processing, ranging from machine translation to question answering, can be reduced to the problem of matching two sentences or more generally two short texts. We propose a new approach to the problem, called Deep Match Tree (DEEPMATCHtree), under a general setting. The approach consists of two components, 1) a mining algorithm to discover patterns for matching two...
متن کاملMatch-SRNN: Modeling the Recursive Matching Structure with Spatial RNN
Semantic matching, which aims to determine the matching degree between two texts, is a fundamental problem for many NLP applications. Recently, deep learning approach has been applied to this problem and significant improvements have been achieved. In this paper, we propose to view the generation of the global interaction between two texts as a recursive process: i.e. the interaction of two tex...
متن کامل